Weighted least squares support vector machines: robustness and sparse approximation
نویسندگان
چکیده
منابع مشابه
Least Squares Support Vector Machines and Primal Space Estimation
In this paper a methodology for estimation in kernel-induced feature spaces is presented, making a link between the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM) and classical statistical inference techniques in order to perform linear regression in primal space. This is done by computing a finite dimensional approximation of the kernel-induced feature space mapping ...
متن کاملNonlinear Modelling and Support Vector Machines
Neural networks such as multilayer perceptrons and radial basis function networks have been very successful in a wide range of problems. In this paper we give a short introduction to some new developments related to support vector machines (SVM), a new class of kernelbased techniques introduced within statistical learning theory and structural risk minimization. This new approach leads to solvi...
متن کاملA Robust LS-SVM Regression
In comparison to the original SVM, which involves a quadratic programming task; LS–SVM simplifies the required computation, but unfortunately the sparseness of standard SVM is lost. Another problem is that LS-SVM is only optimal if the training samples are corrupted by Gaussian noise. In Least Squares SVM (LS–SVM), the nonlinear solution is obtained, by first mapping the input vector to a high ...
متن کاملPii: S0925-2312(01)00644-0
Least squares support vector machines (LS-SVM) is an SVM version which involves equality instead of inequality constraints and works with a least squares cost function. In this way, the solution follows from a linear Karush–Kuhn–Tucker system instead of a quadratic programming problem. However, sparseness is lost in the LS-SVM case and the estimation of the support values is only optimal in the...
متن کاملAn Iterative Learning Algorithm Based on Least Squares Support Vector Regression Machines
Aiming at the problem of the large training data set leading to amounts of calculation a sparse approximation algorithm of least squares support vector machine are proposed. Firstly using the thought of matrix block, convert the optimization problem of a Least Squares support vector machine into low order symmetric positive definite linear systems. Furthermore, use conjugate gradient algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neurocomputing
دوره 48 شماره
صفحات -
تاریخ انتشار 2002